Simultaneous dimension reduction and clustering via the NMF-EM algorithm

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model Based Approaches for Simultaneous Dimension Reduction and Clustering

High dimensional data are regularly generated from various sources. Thus subsets of data are usually concentrated in different subspaces. It is of interest to develop methods that achieve simultaneous dimension reduction and clustering. In this talk we will present a new solution based on a constrained version of mixture of factor analyzers. Our proposed technique imposes constraints on the und...

متن کامل

Efficient NMF Algorithm for Reducing Feature Dimension

An essential and important problem in signal processing, pattern recognition, computer vision and image engineering is how to find a suitable representation of multivariate data, which typically make latent structure in the data clear and often reduce the dimensionality of the data so that further computation or classification can be effectively and efficiently implemented. Principal component ...

متن کامل

Spatial Clustering and the EM Algorithm

A clustering algorithm for spatial data is presented. It seeks a fuzzy partition which is optimal according to some criterion. We propose to penalize the energy function exhibited by Hathway (1986) with a term taking into account spatial contiguity constraints. The structure of the EM algorithm may be used for maximizing the proposed criterion. The Maximization step is then unchanged and the Ex...

متن کامل

The Robust Clustering with Reduction Dimension

A clustering is process to identify a homogeneous groups of object called as cluster. Clustering is one interesting topic on data mining. A group or class behaves similarly characteristics. This paper discusses a robust clustering process for data images with two reduction dimension approaches; i.e. the two dimensional principal component analysis (2DPCA) and principal component analysis (PCA)....

متن کامل

Transformation-Invariant Clustering Using the EM Algorithm

Clustering is a simple, effective way to derive useful representations of data, such as images and videos. Clustering explains the input as one of several prototypes, plus noise. In situations where each input has been randomly transformed (e.g., by translation, rotation, and shearing in images and videos), clustering techniques tend to extract cluster centers that account for variations in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Data Analysis and Classification

سال: 2020

ISSN: 1862-5347,1862-5355

DOI: 10.1007/s11634-020-00398-4